#define _CRT_SECURE_NO_WARNINGS
#include "BinaryTree.h"


test1()
{
	BTNode* node1 = BTBuyNode(1);
	BTNode* node2 = BTBuyNode(2);
	BTNode* node3 = BTBuyNode(3);
	BTNode* node4 = BTBuyNode(4);
	BTNode* node5 = BTBuyNode(5);
	BTNode* node6 = BTBuyNode(6);

	node1->left = node2;
	node1->right = node3;
	node2->left = node4;
	//node2->right = node5;
	node3->left = node6;

	LevelOrder(node1);
	printf("\n%d ", BTComplete(node1));

	//PreOrder(node1);
	//InOrder(node1);
	//PostOrder(node1);

	//int ret = BTNodeSize(node1);
	//printf("%d\n", ret);
	//ret = BTNodeSize(node1);
	//printf("%d\n", ret);

	//int ret = BTLeafNodeSize(node1);
	//printf("%d\n", ret);

	//int ret = BTLevelKNodeSize(node1, );
	//printf("%d\n", ret);

	//int ret = BTDepth(node1);
	//printf("%d\n", ret);

	BTDestory(&node1);
}

int main()
{
	test1();
	return 0;
}